Achieving Unconditional Security by Quantum Cryptography
نویسندگان
چکیده
Classical cryptography algorithms are based on mathematical functions. The robustness of a given cryptosystem is based essentially on the secrecy of its (private) key and the difficulty with which the inverse of its one-way function(s) can be calculated. Unfortunately, there is no mathematical proof that will establish whether it is not possible to find the inverse of a given one-way function. Since few years ago, the progress of quantum physics allowed mastering photons which can be used for informational ends and these technological progresses can also be applied to cryptography (quantum cryptography). Quantum cryptography or Quantum Key Distribution (QKD) is a method for sharing secret keys, whose security can be formally demonstrated. It aims at exploiting the laws of quantum physics in order to carry out a cryptographic task. Its legitimate users can detect eavesdropping, regardless of the technology which the spy may have. In this study, we present quantum cryptosystems as a tool to attain the unconditional security. We also describe the well known protocols used in the field of quantum cryptography.
منابع مشابه
Security Aspect of Quantum Key Distribution
Is the newly born quantum cryptography the ultimate solution for information security? A technique needs to be both theoretically strong and practically viable. But quantum cryptography comes to naught in the latter. Unlike many of the classical cryptosystems in use today, whose security often draws on unproven assumptions about the computational complexity of mathematical problems, the securit...
متن کاملun 2 00 4 Perfect random number generator is unnecessary for secure quantum key distribution
Quantum key distribution(QKD) makes it possible for two remotely separated parties do unconditionally secure communications. In principle, the security is guaranteed by the uncertainty principle in quantum mechanics: if any third party watches the key, she must disturbs the quantum bits therefore she has a risk to be detected. However, the security in practice is quite different, since many of ...
متن کامل0 A Simple Proof of the Unconditional Security of Relativistic Quantum Cryptography
A simple proof of the unconditional security of a relativistic quantum cryptosystem based on orthogonal states is proposed. Restrictions imposed by special relativity allow to substantially simplify the proof compared with the non-relativistic cryptosystems involving non-orthogonal states. Important for the proposed protocol is the spatio-temporal structure of the quantum states which is actual...
متن کاملUnconditional Authenticity and Privacy from an Arbitrarily Weak Secret
Unconditional cryptographic security cannot be generated simply from scratch, but must be based on some given primitive to start with (such as, most typically, a private key). Whether or not this implies that such a high level of security is necessarily impractical depends on how weak these basic primitives can be, and how realistic it is therefore to realize or find them in—classical or quantu...
متن کاملUnconditional security of quantum key distribution and the uncertainty principle
An approach to the unconditional security of quantum key distribution protocols is presented, which is based on the uncertainty principle. The approach applies to every case that has been treated via the argument by Shor and Preskill, but it is not necessary to find quantum error correcting codes. It can also treat the cases with uncharacterized apparatuses. The proof can be applied to cases wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010